On the complexity of working set selectionSIMON, Hans Ulrich.Theoretical computer science. 2007, Vol 382, Num 3, pp 262-279, issn 0304-3975, 18 p.Conference Paper

Learning multiple languages in groupsJAIN, Sanjay; KINBER, Efim.Theoretical computer science. 2007, Vol 387, Num 1, pp 67-76, issn 0304-3975, 10 p.Conference Paper

A note on quadratic residuosity and UPCAI, Jin-Yi; THRELFALL, Robert A.Information processing letters. 2004, Vol 92, Num 3, pp 127-131, issn 0020-0190, 5 p.Article

Ehrenfeucht-Fraïssé goes automatic for real additionKLAEDTKE, Felix.Information and computation (Print). 2010, Vol 208, Num 11, pp 1283-1295, issn 0890-5401, 13 p.Article

A Sturmian sequence related to the uniqueness conjecture for Markoff numbersBUGEAUD, Yann; REUTENAUER, Christophe; SIKSEK, Samir et al.Theoretical computer science. 2009, Vol 410, Num 30-32, pp 2864-2869, issn 0304-3975, 6 p.Article

From truth to computability IIJAPARIDZE, Giorgi.Theoretical computer science. 2007, Vol 379, Num 1-2, pp 20-52, issn 0304-3975, 33 p.Article

Learning attribute-efficiently with corrupt oraclesBENNET, Rotem; BSHOUTY, Nader H.Theoretical computer science. 2007, Vol 387, Num 1, pp 32-50, issn 0304-3975, 19 p.Conference Paper

Sensitivity versus block sensitivity of Boolean functionsVIRZA, Madars.Information processing letters. 2011, Vol 111, Num 9, pp 433-435, issn 0020-0190, 3 p.Article

QUANTUM HARDCORE FUNCTIONS BY COMPLEXITY-THEORETICAL QUANTUM LIST DECODINGKAWACHI, Akinori; YAMAKAMI, Tomoyuki.SIAM journal on computing (Print). 2010, Vol 39, Num 7-8, pp 2941-2969, issn 0097-5397, 29 p.Article

An algorithm for computing simple k-factorsMEIJER, Henk; NUNEZ-RODRIGUEZ, Yurai; RAPPAPORT, David et al.Information processing letters. 2009, Vol 109, Num 12, pp 620-625, issn 0020-0190, 6 p.Article

The unpredictable deviousness of modelsPREPARATA, Franco P.Theoretical computer science. 2008, Vol 408, Num 2-3, pp 99-105, issn 0304-3975, 7 p.Article

On PAC learning algorithms for rich Boolean function classesHELLERSTEIN, Lisa; SERVEDIO, Rocco A.Theoretical computer science. 2007, Vol 384, Num 1, pp 66-76, issn 0304-3975, 11 p.Conference Paper

Introduction to clarithmetic IJAPARIDZE, Giorgi.Information and computation (Print). 2011, Vol 209, Num 10, pp 1312-1354, issn 0890-5401, 43 p.Article

Multiple pass streaming algorithms for learning mixtures of distributions in RCHANG, Kevin L.Theoretical computer science. 2009, Vol 410, Num 19, pp 1765-1780, issn 0304-3975, 16 p.Article

Tackling Inhomogeneous Open Boundary Designs by the Finite-Element MethodNANDAKUMARAN, N; HOOLE, S. Ratnajeevan H.IEEE transactions on magnetics. 2008, Vol 44, Num 3, pp 360-364, issn 0018-9464, 5 p.Article

Reducing the variability of neural responses : A computational theory of spike-timing-dependent plasticityBOHTE, Sander M; MOZER, Michael C.Neural computation. 2007, Vol 19, Num 2, pp 371-403, issn 0899-7667, 33 p.Article

Discriminative leaming can succeed where generative leaming failsLONG, Philip M; SERVEDIO, Rocco A; SIMON, Hans Ulrich et al.Information processing letters. 2007, Vol 103, Num 4, pp 131-135, issn 0020-0190, 5 p.Article

Programmed grammars and their relation to the LBA problemBORDIHN, Henning; HOLZER, Markus.Acta informatica. 2006, Vol 43, Num 4, pp 223-242, issn 0001-5903, 20 p.Article

Representation and timing in theories of the dopamine systemDAW, Nathaniel D; COURVILLE, Aaron C; TOURTEZKY, David S et al.Neural computation. 2006, Vol 18, Num 7, pp 1637-1677, issn 0899-7667, 41 p.Article

Satisfiability of the smallest binary programHANSCHKE, P; WÜRTZ, J.Information processing letters. 1993, Vol 45, Num 5, pp 237-241, issn 0020-0190Article

Symbolic and Numerical AlgorithmsKOTSIREAS, Ilias S; MOURRAIN, Bernard; PAN, Victor Y et al.Theoretical computer science. 2011, Vol 412, Num 16, issn 0304-3975, 103 p.Serial Issue

3rd International Conference on Langage and Automata Theory and Applications (LATA 2009)MARTIN-VIDE, Carlos; TRUTHE, Bianca.Information and computation (Print). 2011, Vol 209, Num 3, issn 0890-5401, 382 p.Conference Proceedings

Logical and Semantic Frameworks with Applications (LSFA 2008 and 2009)AYALA-RINCON, Mauricio; PIMENTEL, Elaine; KAMAREDDINE, Fairouz et al.Theoretical computer science. 2011, Vol 412, Num 37, issn 0304-3975, 118 p.Serial Issue

Security and Cryptography FoundationsYUNG, Moti.Theoretical computer science. 2010, Vol 411, Num 10, issn 0304-3975, 78 p.Conference Proceedings

Mathematical Foundations of Programming Semantics (MFPS 2006)MISLOVE, Michael.Theoretical computer science. 2010, Vol 411, Num 19, issn 0304-3975, 98 p.Conference Proceedings